A Condensed Representation of Itemsets for Analyzing Their Evolution over Time
نویسندگان
چکیده
On Structured Output Training: Hard Cases and an Efficient Alternative p. 7 Spares Kernel SVMs via Cutting-Plane Training p. 8 Hybrid Least-Squares Algorithms for Approximate Policy Evaluation p. 9 A Self-training Approach to Cost Sensitive Uncertainty Sampling p. 10 Learning Multi-linear Representations of Distributions for Efficient Inference p. 11 Cost-Sensitive Learning Based on Bregman Divergences p. 12 Data Mining and Knowledge Discovery Journal Abstracts RTG: A Recursive Realistic Graph Generator Using Random Typing p. 13 Taxonomy-Driven Lumping for Sequence Mining p. 29 On Subgroup Discovery in Numerical Domains p. 30 Harnessing the Strengths of Anytime Algorithms for Constant Data streams p. 31 Identifying the Components p. 32 Two-Way Analysis of High-Dimensional Collinear Data p. 33 A Fast Ensemble Pruning Algorithm Based on Pattern Mining Process p. 34 Regular Papers Evaluation Measures for Multi-class Subgroup Discovery p. 35 Empirical Study of Relational Learning Algorithms in the Phase Transition Framework p. 51
منابع مشابه
Itemset Support Queries Using Frequent Itemsets and Their Condensed Representations
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the frequency information. As index structures we use itemset tries of transaction databases, frequent itemsets and their condensed representations. Second, we evaluate the usefulness of condensed representations of frequent...
متن کاملA contribution to approximate analytical evaluation of Fourier series via an Applied Analysis standpoint; an application in turbulence spectrum of eddies
In the present paper, we shall attempt to make a contribution to approximate analytical evaluation of the harmonic decomposition of an arbitrary continuous function. The basic assumption is that the class of functions that we investigate here, except the verification of Dirichlet's principles, is concurrently able to be expanded in Taylor's representation, over a particular interval of their do...
متن کاملTransaction Databases, Frequent Itemsets, and Their Condensed Representations
Mining frequent itemsets is a fundamental task in data mining. Unfortunately the number of frequent itemsets describing the data is often too large to comprehend. This problem has been attacked by condensed representations of frequent itemsets that are subcollections of frequent itemsets containing only the frequent itemsets that cannot be deduced from other frequent itemsets in the subcollecti...
متن کاملData sanitization in association rule mining based on impact factor
Data sanitization is a process that is used to promote the sharing of transactional databases among organizations and businesses, it alleviates concerns for individuals and organizations regarding the disclosure of sensitive patterns. It transforms the source database into a released database so that counterparts cannot discover the sensitive patterns and so data confidentiality is preserved ag...
متن کاملA Simple but Effective Maximal Frequent Itemset Mining Algorithm over Streams
Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in frequent itemsets using less space, thus being more suitable for stream mining. This paper considers a simple but effective algorithm for mining maximal frequent itemsets over a stream landmark. We design a compact data structure named FP-FOREST to improv...
متن کامل